On the Formal Semantics of IF-Like Logics
نویسندگان
چکیده
In classical logics, the meaning of a formula is invariant with respect to the renaming of bound variables. This property, normally taken for granted, has been shown not to hold in the case of Independence Friendly (IF) logics. In this paper we argue that this is not an inherent characteristic of these logics but a defect in the way in which the compositional semantics given by Hodges for the regular fragment was generalized to arbitrary formulas. We fix this by proposing an alternative formalization, based on a variation of the classical notion of valuation. Basic metatheoretical results are proven. We present these results for Hodges’ slash logic (from which these can be easily transferred to other IF-like logics) and we also consider the flattening operator, for which we give novel game-theoretical semantics.
منابع مشابه
A Proof Theoretic Interpretation of Model Theoretic Hiding
Logical frameworks like LF are used for formal representations of logics in order to make them amenable to formal machine-assisted meta-reasoning. While the focus has originally been on logics with a proof theoretic semantics, we have recently shown how to define model theoretic logics in LF as well. We have used this to define new institutions in the Heterogeneous Tool Set in a purely declarat...
متن کاملSubintuitionistic Logics
Weakening the conditions on the Kripke semantics for propositional intuitionistic logic (J) unearths a family of logics below J. This paper provides a characterization of eleven such logics, using Kripke semantics, proof theory, and algebraic models. Questions about modelling quantification in these logics are also discussed.
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملRn- and Gn-Logics
This paper proposes a simple, set-theoretic framework providing expressive typing, higher-order functions and initial models at the same time. Building upon Russell’s ramified theory of types, we develop the theory of R-logics, which are axiomatisable by an order-sorted equational Horn logic with a membership predicate, and of G-logics, that provide in addition partial functions. The latter are...
متن کامل